Solving multidimensional 0-1 knapsack problem by P systems with input and active membranes
نویسندگان
چکیده
P systems are parallel molecular computing models based on processing multisets of objects in cell-like membrane structures. In this paper we give a membrane algorithm to multidimensional 0–1 knapsack problem in linear time by recognizer P systems with input and with active membranes using 2-division. This algorithm can also be modified to solve general 0–1 integer programming problem.
منابع مشابه
Solving the 0-1 Multidimensional Knapsack Problem with Resolution Search
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0–1 Multidimensional Knapsack Problem. This algorithm is able to prove large–scale strong correlated instances. The optimal values of the 10 constraint, 500 variable instances of the OR-Library are exposed. These values were previously unknown.
متن کاملSolving the Multidimensional Multiple-choice Knapsack Problem by constructing convex hulls
This paper presents a heuristic to solve the Multidimensional Multiple-choice Knapsack Problem (MMKP), a variant of the classical 0–1 Knapsack Problem. We apply a transformation technique to map the multidimensional resource consumption to single dimension. Convex hulls are constructed to reduce the search space to find the near-optimal solution of the MMKP. We present the computational complex...
متن کاملWebPS: A Web-based P System Simulator with Query Facilities
Transition P systems and deterministic P systems with active membranes (see [4]) are simulated in various programming languages, and some of them are used to solve NP-complete problems as SAT, Subset Sum, Knapsack, and partition problems. P systems with active membranes, input membrane and external output are simulated in CLIPS, and used to solve NP-complete problems (see [5]). New variants of ...
متن کاملAn Exact Cooperative Method for Solving the 0-1 Multidimensional Knapsack Problem
This article presents an exact cooperative method for solving the Multidimensional Knapsack Problem (MKP ) which combines dynamic programming and branch and bound. The first step of our algorithm tries to find out a good feasible solution of the (MKP ) using surrogate relaxation. For this purpose, we have developed a modified dynamic programming algorithm. The second step is based on a branch a...
متن کاملA Review and Comparison of Genetic Algorithms for the 0-1 Multidimensional Knapsack Problem
The 0-1 multidimensional knapsack problem (MKP) is a well-known combinatorial optimization problem with several real-life applications, for example, in project selection. Genetic algorithms (GA) are effective heuristics for solving the 0-1 MKP. Multiple individual GAs with specific characteristics have been proposed in literature. However, so far, these approaches have only been partially compa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2005